Partial permutation decoding for codes from Paley

نویسنده

J. Limbupasiriporn

چکیده

We examine codes from the Paley graphs for the purpose of permutation decoding and observe that after a certain length, PD-sets to correct errors up to the code’s error-capability will not exist. In this paper we construct small sets of permutations for correcting two errors by permutation decoding for the case where the codes have prime length.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Codes from incidence matrices and line graphs of Paley graphs

We examine the p-ary codes from incidence matrices of Paley graphs P (q) where q ≡ 1 (mod 4) is a prime power, and show that the codes are [ q(q−1) 4 , q − 1, q−1 2 ]2 or [ q(q−1) 4 , q, q−1 2 ]p for p odd. By finding PD-sets we show that for q > 9 the p-ary codes, for any p, can be used for permutation decoding for full error-correction. The binary code from the line graph of P (q) is shown to...

متن کامل

On the permutation decoding for binary linear and Z4-linear Hadamard codes

Permutation decoding is a technique, introduced in [3] by MacWilliams, that strongly depends on the existence of special subsets, called PD-sets, of the permutation automorphism group PAut(C) of a linear code C. In [2], it is shown how to find s-PD-sets of minimum size s + 1 for partial permutation decoding for the binary simplex code Sm of length 2 − 1, for all m ≥ 4 and 1 < s ≤ ⌊ 2−m−1 m ⌋ . ...

متن کامل

Partial permutation decoding for binary linear Hadamard codes

Permutation decoding is a technique which involves finding a subset S, called PDset, of the permutation automorphism group PAut(C) of a code C in order to assist in decoding. A method to obtain s-PD-sets of size s + 1 for partial permutation decoding for the binary linear Hadamard codes Hm of length 2 m, for all m ≥ 4 and 1 < s ≤ b(2m −m− 1)/(1 + m)c, is described. Moreover, a recursive constru...

متن کامل

Information sets and partial permutation decoding for codes from finite geometries

We determine information sets for the generalized Reed-Muller codes and use these to apply partial permutation decoding to codes from finite geometries over prime fields. We also obtain new bases of minimum-weight vectors for the codes of the designs of points and hyperplanes over prime fields.

متن کامل